pso-based path planning algorithm for humanoid robots considering safety

نویسندگان

roham shakiba

mechatronics research lab., electrical, computer, and it dept, qazvin branch, islamic azad university, qazvin, iran mostafa e. salehi

mechatronics research lab., electrical, computer, and it dept, qazvin branch, islamic azad university, qazvin, iran

چکیده

in this paper we introduce an improvement in the path planning algorithm for the humanoid soccer playing robot which uses ferguson splines and pso (particle swarm optimization). the objective of the algorithm is to find a path through other playing robots to the ball, which should be as short as possible and also safe enough. ferguson splines create preliminary paths using random generated parameters. the random parameters are then iteratively fed into the pso for optimization and converging to optimal path. our proposed method makes a balance between the path shortness and the safety which makes it more efficient for humanoid soccer playing robots and also for any other crowded environment with various moving obstacles. experimental results show that our proposed algorithm converges in at most 60 iterations with the average accuracy of 92% and the maximum path length overhead of 14% for planning the shortest and yet safest path.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

PSO-Based Path Planning Algorithm for Humanoid Robots Considering Safety

In this paper we introduce an improvement in the path planning algorithm for the humanoid soccer playing robot which uses Ferguson splines and PSO (Particle Swarm Optimization). The objective of the algorithm is to find a path through other playing robots to the ball, which should be as short as possible and also safe enough. Ferguson splines create preliminary paths using random generated para...

متن کامل

Fast Manipulation Path Planning for Humanoid Robots

|We present an interactive manipulation path planner under development for providing high-level task-based control for humanoid robots. Using a graphical simulation environment, the software is designed to facilitate the automation of object grasping and manipulation tasks. A randomized path planner is used to directly search the free con guration space of the robot for a collision-free manipul...

متن کامل

Path Planning for Formations of Mobile Robots using PSO Technique

Multi-robotics systems are currently subject of major interest in the robotics literature. In the leading journals can be found hundreds of articles, published in the last few years, concerning applications and theoretical studies of small groups maintaining in fixed formation (Fua et al., 2007; Kaminka et al., 2008) as well as swarms of thousands robots (Derenick & Spletzet, 2007; Daigle et. a...

متن کامل

Evolutionary Path Planning Algorithm for Industrial Robots

This paper proposed a new methodology to solve collision free path planning problem for industrial robot using genetic algorithms. The method poses an optimization problem that aims to minimize the significant points traveling distance of the robot. The behaviour of more two operational parameters – the end effector traveling distance and computational time – is analysed. This algorithm is able...

متن کامل

Path Planning Algorithm for Snake-like Robots

Snake-like robots have the ability of automatically performing various tasks that require man-equivalent capabilities by reaching areas difficult or impossible to reach for human beings. However, problems in path planning and design of such robots prevent them from being fully functional. In this paper, a path planning algorithm for snakelike robots is presented. Snake-like robots are modeled w...

متن کامل

Cellular Automata Based Path-planning Algorithm for Autonomous Mobile Robots

This paper presents the application of Cellular Automata (CA) model in solving the problem of path planning. It is shown that a CA allows the efficient computation of a path from an initial to a goal configuration on a physical space cluttered with obstacles. The cellular space represents a discrete version of the workspace. The method was experimentally tested on an autonomous mobile robot on ...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
journal of computer and robotics

جلد ۷، شماره ۲، صفحات ۴۷-۵۴

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023